Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Model?theoretic Aspects
نویسندگان
چکیده
In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called elementary. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called canonical. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize main ideas and results, and outline further research perspectives.
منابع مشابه
Elementary canonical formulae: extending Sahlqvist's theorem
We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of mi...
متن کاملAlgorithmic correspondence and completeness in modal logic
This thesis takes an algorithmic perspective on the correspondence between modal and hybrid logics on the one hand, and first-order logic on the other. The canonicity of formulae, and by implication the completeness of logics, is simultaneously treated. Modal formulae define second-order conditions on frames which, in some cases, are equivalently reducible to first-order conditions. Modal formu...
متن کاملThe Tangent Cones at Double points of Prym-Canonical Divisors of Curves of genus 7
Let η be a line bundle on a smooth curve X with η^2=0 such that π_η, the double covering induced by η is an etale morphism. Assume also that X_η be the Prym-canonical model of X associated to K_X.η and Q is a rank 4 quadric containing X_η. After stablishing the projective normality of the prym-canonical models of curves X with Clifford index 2, we obtain in this paper a sufficient condition for...
متن کاملModel Theoretic Syntax and Parsing: An Application to Temporal Logic
In general, model-theoretic approaches to syntax aim to describe the syntactic structures of natural languages by means of logical formulae so that the structures are models of these formulae. However, in practice, the use of such descriptions for processing issues involves so much complexity, that they appear to be more or less useless for such tasks. We present a simple formalism, which is ba...
متن کاملAn Automata Theoretic Approach to the Zero-One Law for Regular Languages: Algorithmic and Logical Aspects
A zero-one language L is a regular language whose asymptotic probability converges to either zero or one. In this case, we say that L obeys the zero-one law. We prove that a regular language obeys the zero-one law if and only if its syntactic monoid has a zero element, by means of Eilenberg’s variety theoretic approach. Our proof gives an effective automata characterisation of the zero-one law ...
متن کامل